0.04/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.13	% Command    : run_vampire %s %d
0.12/0.34	% Computer   : n002.cluster.edu
0.12/0.34	% Model      : x86_64 x86_64
0.12/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory     : 8042.1875MB
0.12/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 1200
0.12/0.34	% WCLimit    : 120
0.12/0.34	% DateTime   : Tue Jul 13 14:31:33 EDT 2021
0.12/0.35	% CPUTime    : 
0.12/0.35	This is a THF_ problem
0.12/0.35	Running vampire --ignore_missing on --mode casc_hol --cores 0 -t 120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.12/0.35	Running in auto input_syntax mode. Trying TPTP
0.20/0.39	% (6285)dis-11_3_add=off:afp=40000:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afq=1.0:amm=sco:anc=none:gs=on:irw=on:lcm=reverse:nm=6:nwc=1:sd=4:ss=axioms:st=3.0:sos=on:sac=on:thsq=on_2 on theBenchmark
0.20/0.40	% (6299)lrs+1010_8_add=off:afp=100000:csup=on:inj=off:cases=on:chr=off:e2e=on:cnfonf=eager:afq=1.0:amm=off:anc=none:irw=on:nm=16:newcnf=on:nwc=1.1:nicw=on:stl=30:sp=reverse_arity:urr=on:thsq=on_13 on theBenchmark
0.20/0.40	% (6274)ott+1002_2_av=off:bd=preordered:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:irw=on:lma=on:nm=64:nwc=10:sp=reverse_arity:updr=off:thsq=on_2 on theBenchmark
0.20/0.40	% (6276)lrs+1011_8_add=large:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afp=100000:afq=1.1:er=filter:gsp=input_only:gs=on:gsem=on:lma=on:nm=6:nwc=1:stl=30:sd=2:ss=axioms:st=1.5:sos=on:thsq=on_3 on theBenchmark
0.20/0.40	% (6275)lrs-11_4:1_afp=4000:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afq=2.0:anc=none:br=off:gs=on:lwlo=on:nm=64:nwc=3:stl=30:urr=on:thsq=on_2 on theBenchmark
0.20/0.40	% (6284)dis+10_128_acc=on:add=off:add=off:afp=4000:afq=1.4:amm=off:bd=preordered:cond=on:fsr=off:fde=unused:gs=on:gsem=on:irw=on:lma=on:nm=64:nwc=1.2:nicw=on:sos=on:sp=occurrence:updr=off:uhcvi=on:thsq=on_40 on theBenchmark
0.20/0.40	% (6287)lrs+1010_3_av=off:fsr=off:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:gs=on:gsem=off:nm=2:newcnf=on:nwc=2:stl=30:sp=reverse_arity:urr=on:updr=off:thsq=on_9 on theBenchmark
0.20/0.40	% (6286)dis+1002_6_add=large:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afp=40000:afq=2.0:bsr=on:cond=on:irw=on:lma=on:nm=2:nwc=2.5:nicw=on:sp=reverse_arity:updr=off:thsq=on_2 on theBenchmark
0.20/0.40	% (6276)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
0.20/0.40	% (6287)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
0.20/0.41	% (6296)dis+10_4_av=off:bsr=on:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:cond=fast:er=filter:fde=none:gsp=input_only:lcm=reverse:lma=on:nwc=4:sp=occurrence:urr=on:thsq=on_8 on theBenchmark
0.20/0.41	% (6291)lrs+1011_5:1_acc=on:csup=on:inj=on:e2e=on:prag=on:cases=on:cnfonf=eager:amm=off:anc=all_dependent:bd=off:ccuc=small_ones:fde=unused:gs=on:gsaa=full_model:gsem=off:lcm=predicate:lwlo=on:nm=6:newcnf=on:nwc=2.5:stl=30:sp=occurrence:updr=off:thsq=on_30 on theBenchmark
0.20/0.41	% (6296)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
0.20/0.41	% (6288)lrs+1002_1_av=off:er=filter:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:fsr=off:gs=on:gsem=off:irw=on:lma=on:nm=4:nwc=1:stl=30:sd=3:ss=axioms:st=1.5:sos=on:thsq=on_1 on theBenchmark
0.20/0.41	% (6285)First to succeed.
0.20/0.41	% (6299)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
0.20/0.42	% (6285)Refutation found. Thanks to Tanya!
0.20/0.42	% SZS status Theorem for theBenchmark
0.20/0.42	% SZS output start Proof for theBenchmark
0.20/0.42	thf(type_def_6, type, >: ($tType * $tType) > $tType).
0.20/0.42	thf(func_def_7, type, leibeq: ($o > $o > $o) > ($o > $o > $o) > $o).
0.20/0.42	thf(func_def_9, type, vAND: $o > $o > $o).
0.20/0.42	thf(func_def_10, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
0.20/0.42	thf(func_def_13, type, vNOT: $o > $o).
0.20/0.42	thf(func_def_14, type, vOR: $o > $o > $o).
0.20/0.42	thf(func_def_15, type, bCOMB: !>[X0: $tType, X1: $tType, X2: $tType]:((X1 > X2) > (X0 > X1) > X0 > X2)).
0.20/0.42	thf(func_def_16, type, cCOMB: !>[X0: $tType, X1: $tType, X2: $tType]:((X0 > X1 > X2) > X1 > X0 > X2)).
0.20/0.42	thf(func_def_17, type, vIMP: $o > $o > $o).
0.20/0.42	thf(func_def_18, type, vPI: !>[X0: $tType]:((X0 > $o) > $o)).
0.20/0.42	thf(func_def_19, type, iCOMB: !>[X0: $tType]:(X0 > X0)).
0.20/0.42	thf(func_def_20, type, sCOMB: !>[X0: $tType, X1: $tType, X2: $tType]:((X0 > X1 > X2) > (X0 > X1) > X0 > X2)).
0.20/0.42	thf(func_def_22, type, kCOMB: !>[X0: $tType, X1: $tType]:(X0 > X1 > X0)).
0.20/0.42	thf(func_def_23, type, vEQ: !>[X0: $tType]:(X0 > X0 > $o)).
0.20/0.42	thf(func_def_27, type, sK1: ($o > $o > $o) > $o).
0.20/0.42	thf(f62,plain,(
0.20/0.42	  $false),
0.20/0.42	  inference(trivial_inequality_removal,[],[f61])).
0.20/0.42	thf(f61,plain,(
0.20/0.42	  (sK4 != sK4)),
0.20/0.42	  inference(boolean_simplification,[],[f60])).
0.20/0.42	thf(f60,plain,(
0.20/0.42	  (sK4 != (vNOT @ (vNOT @ sK4)))),
0.20/0.42	  inference(boolean_simplification,[],[f59])).
0.20/0.42	thf(f59,plain,(
0.20/0.42	  (sK4 != (vNOT @ ((vOR @ $false) @ (vNOT @ sK4))))),
0.20/0.42	  inference(combinator_demodulation,[],[f58])).
0.20/0.42	thf(f58,plain,(
0.20/0.42	  (sK4 != (((bCOMB @ vNOT) @ ((bCOMB @ (vOR @ $false)) @ vNOT)) @ sK4))),
0.20/0.42	  inference(boolean_simplification,[],[f57])).
0.20/0.42	thf(f57,plain,(
0.20/0.42	  (((vAND @ $true) @ sK4) != (((bCOMB @ vNOT) @ ((bCOMB @ (vOR @ $false)) @ vNOT)) @ sK4))),
0.20/0.42	  inference(negative_extensionality,[],[f56])).
0.20/0.42	thf(f56,plain,(
0.20/0.42	  ((vAND @ $true) != ((bCOMB @ vNOT) @ ((bCOMB @ (vOR @ $false)) @ vNOT)))),
0.20/0.42	  inference(boolean_simplification,[],[f55])).
0.20/0.42	thf(f55,plain,(
0.20/0.42	  ((vAND @ $true) != ((bCOMB @ vNOT) @ ((bCOMB @ (vOR @ (vNOT @ $true))) @ vNOT)))),
0.20/0.42	  inference(backward_demodulation,[],[f23,f43])).
0.20/0.42	thf(f43,plain,(
0.20/0.42	  ($true = sK2)),
0.20/0.42	  inference(duplicate_literal_removal,[],[f42])).
0.20/0.42	thf(f42,plain,(
0.20/0.42	  ($true = sK2) | ($true = sK2)),
0.20/0.42	  inference(not_proxy_clausification,[],[f41])).
0.20/0.42	thf(f41,plain,(
0.20/0.42	  ($true = sK2) | ($false = (vNOT @ sK2))),
0.20/0.42	  inference(binary_proxy_clausification,[],[f39])).
0.20/0.42	thf(f39,plain,(
0.20/0.42	  ($true = sK2) | ($false = ((vOR @ (vNOT @ sK2)) @ (vNOT @ sK3)))),
0.20/0.42	  inference(not_proxy_clausification,[],[f38])).
0.20/0.42	thf(f38,plain,(
0.20/0.42	  ($true = sK2) | ($true = (vNOT @ ((vOR @ (vNOT @ sK2)) @ (vNOT @ sK3))))),
0.20/0.42	  inference(binary_proxy_clausification,[],[f28])).
0.20/0.42	thf(f28,plain,(
0.20/0.42	  ($true = ((vAND @ sK2) @ sK3)) | ($true = (vNOT @ ((vOR @ (vNOT @ sK2)) @ (vNOT @ sK3))))),
0.20/0.42	  inference(binary_proxy_clausification,[],[f27])).
0.20/0.42	thf(f27,plain,(
0.20/0.42	  (((vAND @ sK2) @ sK3) != (vNOT @ ((vOR @ (vNOT @ sK2)) @ (vNOT @ sK3))))),
0.20/0.42	  inference(combinator_demodulation,[],[f26])).
0.20/0.42	thf(f26,plain,(
0.20/0.42	  (((vAND @ sK2) @ sK3) != (((bCOMB @ vNOT) @ ((bCOMB @ (vOR @ (vNOT @ sK2))) @ vNOT)) @ sK3))),
0.20/0.42	  inference(negative_extensionality,[],[f23])).
0.20/0.42	thf(f23,plain,(
0.20/0.42	  ((vAND @ sK2) != ((bCOMB @ vNOT) @ ((bCOMB @ (vOR @ (vNOT @ sK2))) @ vNOT)))),
0.20/0.42	  inference(combinator_demodulation,[],[f22])).
0.20/0.42	thf(f22,plain,(
0.20/0.42	  ((vAND @ sK2) != (((bCOMB @ (bCOMB @ vNOT)) @ ((cCOMB @ ((bCOMB @ bCOMB) @ ((bCOMB @ vOR) @ vNOT))) @ vNOT)) @ sK2))),
0.20/0.42	  inference(negative_extensionality,[],[f20])).
0.20/0.42	thf(f20,plain,(
0.20/0.42	  (vAND != ((bCOMB @ (bCOMB @ vNOT)) @ ((cCOMB @ ((bCOMB @ bCOMB) @ ((bCOMB @ vOR) @ vNOT))) @ vNOT)))),
0.20/0.42	  inference(trivial_inequality_removal,[],[f19])).
0.20/0.42	thf(f19,plain,(
0.20/0.42	  ($true = $false) | (vAND != ((bCOMB @ (bCOMB @ vNOT)) @ ((cCOMB @ ((bCOMB @ bCOMB) @ ((bCOMB @ vOR) @ vNOT))) @ vNOT)))),
0.20/0.42	  inference(constrained_superposition,[],[f17,f16])).
0.20/0.42	thf(f16,plain,(
0.20/0.42	  ($false = (sK1 @ ((bCOMB @ (bCOMB @ vNOT)) @ ((cCOMB @ ((bCOMB @ bCOMB) @ ((bCOMB @ vOR) @ vNOT))) @ vNOT))))),
0.20/0.42	  inference(binary_proxy_clausification,[],[f15])).
0.20/0.42	thf(f15,plain,(
0.20/0.42	  ($false = ((vIMP @ (sK1 @ vAND)) @ (sK1 @ ((bCOMB @ (bCOMB @ vNOT)) @ ((cCOMB @ ((bCOMB @ bCOMB) @ ((bCOMB @ vOR) @ vNOT))) @ vNOT)))))),
0.20/0.42	  inference(combinator_demodulation,[],[f14])).
0.20/0.42	thf(f14,plain,(
0.20/0.42	  ($false = (((sCOMB @ ((bCOMB @ vIMP) @ ((cCOMB @ iCOMB) @ vAND))) @ ((cCOMB @ iCOMB) @ ((bCOMB @ (bCOMB @ vNOT)) @ ((cCOMB @ ((bCOMB @ bCOMB) @ ((bCOMB @ vOR) @ vNOT))) @ vNOT)))) @ sK1))),
0.20/0.42	  inference(sigma_clausification,[],[f13])).
0.20/0.42	thf(f13,plain,(
0.20/0.42	  ($true != (vPI(($o > $o > $o) > $o) @ ((sCOMB @ ((bCOMB @ vIMP) @ ((cCOMB @ iCOMB) @ vAND))) @ ((cCOMB @ iCOMB) @ ((bCOMB @ (bCOMB @ vNOT)) @ ((cCOMB @ ((bCOMB @ bCOMB) @ ((bCOMB @ vOR) @ vNOT))) @ vNOT))))))),
0.20/0.42	  inference(combinator_demodulation,[],[f12])).
0.20/0.42	thf(f12,plain,(
0.20/0.42	  ($true != ((((bCOMB @ (bCOMB @ vPI(($o > $o > $o) > $o))) @ ((cCOMB @ ((bCOMB @ bCOMB) @ ((bCOMB @ sCOMB) @ ((bCOMB @ (bCOMB @ vIMP)) @ (cCOMB @ iCOMB))))) @ (cCOMB @ iCOMB))) @ vAND) @ ((bCOMB @ (bCOMB @ vNOT)) @ ((cCOMB @ ((bCOMB @ bCOMB) @ ((bCOMB @ vOR) @ vNOT))) @ vNOT))))),
0.20/0.42	  inference(definition_unfolding,[],[f10,f11])).
0.20/0.42	thf(f11,plain,(
0.20/0.42	  (leibeq = ((bCOMB @ (bCOMB @ vPI(($o > $o > $o) > $o))) @ ((cCOMB @ ((bCOMB @ bCOMB) @ ((bCOMB @ sCOMB) @ ((bCOMB @ (bCOMB @ vIMP)) @ (cCOMB @ iCOMB))))) @ (cCOMB @ iCOMB))))),
0.20/0.42	  inference(cnf_transformation,[],[f8])).
0.20/0.42	thf(f8,plain,(
0.20/0.42	  (leibeq = ((bCOMB @ (bCOMB @ vPI(($o > $o > $o) > $o))) @ ((cCOMB @ ((bCOMB @ bCOMB) @ ((bCOMB @ sCOMB) @ ((bCOMB @ (bCOMB @ vIMP)) @ (cCOMB @ iCOMB))))) @ (cCOMB @ iCOMB))))),
0.20/0.42	  inference(fool_elimination,[],[f7])).
0.20/0.42	thf(f7,plain,(
0.20/0.42	  (leibeq = (^[X0 : $o > $o > $o, X1 : $o > $o > $o] : (! [X2 : ($o > $o > $o) > $o] : ((X2 @ X0) => (X2 @ X1)))))),
0.20/0.42	  inference(rectify,[],[f1])).
0.20/0.42	thf(f1,axiom,(
0.20/0.42	  (leibeq = (^[X0 : $o > $o > $o, X1 : $o > $o > $o] : (! [X2 : ($o > $o > $o) > $o] : ((X2 @ X0) => (X2 @ X1)))))),
0.20/0.42	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',leibeq)).
0.20/0.42	thf(f10,plain,(
0.20/0.42	  ($true != ((leibeq @ vAND) @ ((bCOMB @ (bCOMB @ vNOT)) @ ((cCOMB @ ((bCOMB @ bCOMB) @ ((bCOMB @ vOR) @ vNOT))) @ vNOT))))),
0.20/0.42	  inference(cnf_transformation,[],[f9])).
0.20/0.42	thf(f9,plain,(
0.20/0.42	  ($true != ((leibeq @ vAND) @ ((bCOMB @ (bCOMB @ vNOT)) @ ((cCOMB @ ((bCOMB @ bCOMB) @ ((bCOMB @ vOR) @ vNOT))) @ vNOT))))),
0.20/0.42	  inference(flattening,[],[f6])).
0.20/0.42	thf(f6,plain,(
0.20/0.42	  ~($true = ((leibeq @ vAND) @ ((bCOMB @ (bCOMB @ vNOT)) @ ((cCOMB @ ((bCOMB @ bCOMB) @ ((bCOMB @ vOR) @ vNOT))) @ vNOT))))),
0.20/0.42	  inference(fool_elimination,[],[f5])).
0.20/0.42	thf(f5,plain,(
0.20/0.42	  ~((leibeq @ vAND) @ (^[X0 : $o, X1 : $o] : (~(~X1 | ~X0))))),
0.20/0.42	  inference(rectify,[],[f3])).
0.20/0.42	thf(f3,negated_conjecture,(
0.20/0.42	  ~((leibeq @ vAND) @ (^[X0 : $o, X1 : $o] : (~(~X1 | ~X0))))),
0.20/0.42	  inference(negated_conjecture,[],[f2])).
0.20/0.42	thf(f2,conjecture,(
0.20/0.42	  ((leibeq @ vAND) @ (^[X0 : $o, X1 : $o] : (~(~X1 | ~X0))))),
0.20/0.42	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)).
0.20/0.42	thf(f17,plain,(
0.20/0.42	  ($true = (sK1 @ vAND))),
0.20/0.42	  inference(binary_proxy_clausification,[],[f15])).
0.20/0.42	% SZS output end Proof for theBenchmark
0.20/0.42	% (6285)------------------------------
0.20/0.42	% (6285)Version: Vampire 4.6.0 (commit 0afb7ed4a on 2021-06-23 15:27:21 +0100)
0.20/0.42	% (6285)Termination reason: Refutation
0.20/0.42	
0.20/0.42	% (6285)Memory used [KB]: 10362
0.20/0.42	% (6285)Time elapsed: 0.037 s
0.20/0.42	% (6285)------------------------------
0.20/0.42	% (6285)------------------------------
0.20/0.42	% (6273)Success in time 0.06 s
0.20/0.42	EOF